Infinite Combinatorics: from Finite to Infinite
نویسندگان
چکیده
We investigate the relationship between some theorems in finite combinatorics and their infinite counterparts: given a “finite” result how one can get an “infinite” version of it? We will also analyze the relationship between the proofs of a “finite” theorem and the proof of its “infinite” version. Besides these comparisons, the paper gives a proof of a theorem of Erdős, Grünwald and Vázsonyi giving the full descriptions of graphs having one/two-way infinite Euler lines. The last section contains some new results: an infinite version of a multiway-cut theorem is included.
منابع مشابه
Numerical Modeling of Railway Track Supporting System using Finite-Infinite and Thin Layer Elements
The present contribution deals with the numerical modeling of railway track-supporting systems-using coupled finite-infinite elements-to represent the near and distant field stress distribution, and also employing a thin layer interface element to account for the interfacial behavior between sleepers and ballast. To simulate the relative debonding, slipping and crushing at the contact area betw...
متن کاملConcepts and Application of Three Dimensional Infinite Elements to Soil Structure-Interaction Problems
This study is concerned with the formulation of three dimensional mapped infinite elements with 1/r and 1/ decay types. These infinite elements are coupled with conventional finite elements and their application to some problems of soil structure interaction are discussed. The effeciency of the coupled finite-infinite elements formulation with respect to computational effort, data preparation a...
متن کاملEntropy of infinite systems and transformations
The Kolmogorov-Sinai entropy is a far reaching dynamical generalization of Shannon entropy of information systems. This entropy works perfectly for probability measure preserving (p.m.p.) transformations. However, it is not useful when there is no finite invariant measure. There are certain successful extensions of the notion of entropy to infinite measure spaces, or transformations with ...
متن کاملThe Cycle Space of an Infinite Graph
Finite graph homology may seem trivial, but for infinite graphs things become interesting. We present a new approach that builds the cycle space of a graph not on its finite cycles but on its topological circles, the homeomorphic images of the unit circle in the space formed by the graph together with its ends. Our approach permits the extension to infinite graphs of standard results about fini...
متن کاملInfinite Partition Regular Matrices , II – Extending the Finite Results
A finite or infinite matrix A is image partition regular provided that whenever N is finitely colored, there must be some ~x with entries from N such that all entries of A~x are in the same color class. Using the algebraic structure of the StoneČech compactification βN of N, along with a good deal of elementary combinatorics, we investigate the degree to which the known characterizations of fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010